Abstract template
نویسنده
چکیده
Datacom and Telecom are continuously evolving in terms of bandwidth, consumption and cost. The general request is bandwith increase with no change or even reduction of overall consumption and cost. According to the Ethernet roadmap the bandwidth doubles every two years [1]. The actual candidate technology for large volume and low cost is Si Photonics [2]. With Si Photonics it is possible to realize electro-refractive modulators and Ge based detectors exceeding 56Gb/s bandwidth in a single channel and at 28Gb/s this is already a product [3]. This technology has been widely studied and, for large volumes and for bandwidth of 28Gb/s or more is competitive with respect to III-V technologies or discrete photonic micro assemblies. However the Datacom roadmap requires cost /performance continuous improvements and technological limits may limit the scalability of the existing technologies. Graphene offers electro-absortption [4] and electro-refraction [5] effect for modulators and thermoelectric effect for the detection [6]. Graphene layers can be transferred on waveguides in the postprocessing phase, the supporting waveguide has very limited requirements because no dopants are required for operating the devices. Silica, Si, or even polymer waveguides are all devisable because active functionalities will depend on the post-processed graphene layers. Graphene based photonics is proven by design on the base of material models verified by characterizations.[7] From theory graphene photonics can be competitive with respect to Si Photonics but experimental verifications have to confirm this claim. Even though modulators and detectors have been proven, a new generation of designs is required to improve further performances. One issue is that graphene modulators are limited by the electron mobility of the transferred graphene. In order to increase mobility graphene has to be encapsulated with a barrier material that decouples graphene from the external materials. h-BN encapsulation can maintain mobility as large as 10 4 m 2 /(Vs). Lack of large mobility induces both insertion loss and dynamic range reduction in the modulator, increase of resistivity in the contacts and in the graphene fingers from the active region to the electrode. [8] Graphene electro-optical properties are also interestingly independent of the wavelength. In comparison Si Photonics is limited in the spectral range to 1600nm in which Ge detectors can absorb and to Si absorption edge at 1100nm on the other hand. In fact Si Potonics is mainly used for the O (1265 – 1390nm) and C (1530 – 1560nm) band of the telecom windows. Graphene spectral range can be easily extended from visible through 2000nm and beyond. This offers a great advantage in terms of power consumption because a course wavelength separation in a very wide range allows many channels operating in uncooled systems with no thermal control. Graphene fabrication on a large area is another important topic that would allow wafer scale manufacturing. Presently CVD graphene transfer from Cu substrate on the final wafer ensures best performance in terms of uniformity and electron mobility even though the method requires further developments to increase reproducibility and stability. Other alternative methods are considered but presently those are not mature yet. In this presentation all aspects of graphene technology and photonics devices for Datacom applications will be reviewed with focus on feasibility and compliance with existing technologies.
منابع مشابه
Polynomial Template Generation using Sum-of-Squares Programming
Template abstract domains allow to express more interesting properties than classical abstract domains. However, template generation is a challenging problem when one uses template abstract domains for program analysis. In this paper, we relate template generation with the program properties that we want to prove. We focus on one-loop programs with nested conditional branches. We formally defin...
متن کاملUsing Template Haskell for Abstract Interpretation
Metaprogramming consists of writing programs that generate or manipulate other programs. Template Haskell is a recent extension of Haskell, currently implemented in the Glasgow Haskell Compiler, giving support to metaprogramming at compile time. Our aim is to apply these facilities in order to statically analyse programs and transform them at compile time. In this paper we use Template Haskell ...
متن کاملTowards a Text Generation Template Language for Modelica
The uses, needs, and requirements of a text generation template language for Modelica are discussed. A template language may allow more concise and readable programming of the generation of textual models, program code, or documents, from a structured model representation such as abstract syntax trees (AST). Applications can be found in generating simulation code in other programming languages ...
متن کاملTemplate-Based Unbounded Time Verification of Affine Hybrid Automata
Computing over-approximations of all possible time trajectories is an important task in the analysis of hybrid systems. Sankaranarayanan et al. [20] suggested to approximate the set of reachable states using template polyhedra. In the present paper, we use a max-strategy improvement algorithm for computing an abstract semantics for affine hybrid automata that is based on template polyhedra and ...
متن کاملGeneration Mechanisms in Graphical Template Language
Textual models in MDD typically are generated in their concrete syntax using a template based language. On the contrary, graphical models as a rule are generated in abstract syntax and then visualized, which is not very efficient for complicated languages. The paper discusses a case of template based generation of graphical models in a concrete syntax. We apply this approach to generation of pr...
متن کاملTowards Automatic Generation of a Coherent TTCN-3 Template Framework
The template framework is a subset of TTCN-3 template declarations, which determines the entire template hierarchy within an abstract test suite. This paper introduces a deterministic method fortest suite. This paper introduces a deterministic method for generating such a template framework from type definitions.
متن کامل